Guillaume Aucher An Internal Version of Epistemic Logic
نویسندگان
چکیده
Representing an epistemic situation involving several agents obviously depends on the modeling point of view one takes. We start by identifying the types of modeling points of view which are logically possible. We call the one traditionally followed by epistemic logic the perfect external approach, because there the modeler is assumed to be an omniscient and external observer of the epistemic situation. In the rest of the paper we focus on what we call the internal approach, where the modeler is one of the agents involved in the situation. For this approach we propose and axiomatize a logical formalism based on epistemic logic. This leads us to formalize some intuitions about the internal approach and about its connections with the external ones. Finally, we show that our internal logic is decidable and PSPACE-complete.
منابع مشابه
Private announcement and belief expansion: an internal perspective
AGM belief revision theory and the BMS framework of dynamic epistemic logic both deal with the formalization of belief change, the former in a single agent setting and the latter in a multiagent setting. In this paper we study the relation between these two formalisms. To be fair, we restrict our attention to the AGM operation of expansion since the original BMS framework does not allow for bel...
متن کاملAutomata Techniques for Epistemic Protocol Synthesis
In this work we aim at applying automata techniques to problems studied in Dynamic Epistemic Logic, such as epistemic planning. To do so, we first remark that repeatedly executing ad infinitum a propositional event model from an initial epistemic model yields a relational structure that can be finitely represented with automata. This correspondence, together with recent results on uniform strat...
متن کاملOn the Complexity of Dynamic Epistemic Logic
Although Dynamic Epistemic Logic (DEL) is an influential logical framework for representing and reasoning about information change, little is known about the computational complexity of its associated decision problems. In fact, we only know that for public announcement logic, a fragment of DEL, the satisfiability problem and the model-checking problem are respectively PSPACE-complete and in P....
متن کاملAxioms .2 and .4 as Interaction Axioms
In epistemic logic, some axioms dealing with the notion of knowledge are rather convoluted and it is difficult to give them an intuitive interpretation, even if some of them, like .2 and .4, are considered by some epistemic logicians to be key axioms. We show that they can be characterized in terms of understandable interaction axioms relating knowledge and belief. In order to show it, we first...
متن کاملPrescriptive and Descriptive Obligations in Dynamic Epistemic Deontic Logic
Normative sentences can be used to change or to describe the normative system, known as prescriptive and descriptive obligations respectively. In applications of deontic logic it is important to distinguish these two uses of normative sentences. In this paper we show how they can be distinguished and analysed in a dynamic epistemic deontic logic.
متن کامل